An interior point cutting plane algorithm for Ising spin glass problems
نویسنده
چکیده
An interior point cutting plane algorithm for solving Maximum Cut problems of a particular structure is described. The problem of interest is determining the ground states of two dimensional J Ising spin glasses on square lattices with nearest neighbour interactions and periodic boundary conditions. Computational results for grids of sizes up to 100 100 are presented. An estimate of the ground state energy of an in nite spin glass system with the proportion of negative bonds equal to 0:5 is given.
منابع مشابه
Solving Real World Linear Ordering Problems Using a Primal Dual Interior Point Cutting Plane Method
Cutting plane methods require the solution of a sequence of linear programs where the solution to one provides a warm start to the next A cutting plane algorithm for solving the linear ordering problem is described This algorithm uses the primal dual interior point method to solve the linear programming relaxations A point which is a good warm start for a simplex based cutting plane algorithm i...
متن کاملComputational Experience with an Interior Point Cutting Plane Algorithm
There has been a great deal of success in the last twenty years with the use of cutting plane algorithms to solve specialized integer programming problems. Generally, these algorithms work by solving a sequence of linear programming relaxations of the integer programming problem, and they use the simplex algorithm to solve the relaxations. In this paper, we describe experiments using a predicto...
متن کامل1 Solving Linear Ordering Problems with a Combined Interior Point / Simplex Cutting Plane Algorithm
We describe a cutting plane algorithm for solving linear ordering problems. The algorithm uses a primal-dual interior point method to solve the rst few relaxations and then switches to a simplex method to solve the last few relaxations. The simplex method uses CPLEX 4.0. We compare the algorithm with one that uses only an interior point method and with one that uses only a simplex method. We so...
متن کاملInterior Point and Semidefinite Approaches in Combinatorial Optimization
Conic programming, especially semidefinite programming (SDP), has been regarded as linear programming for the 21st century. This tremendous excitement was spurred in part by a variety of applications of SDP in integer programming (IP) and combinatorial optimization, and the development of efficient primal-dual interior-point methods (IPMs) and various first order approaches for the solution of ...
متن کاملImplementation of a Cutting Plane Method for Semidefinite Programming
Semidefinite programming refers to a class of problems that optimizes a linear cost function while insuring that a linear combination of symmetric matrices is positive definite. Currently, interior point methods for linear programming have been extended to semidefinite programming, but they possess some drawbacks. So, researchers have been investigating alternatives to interior point schemes. K...
متن کامل